<!DOCTYPE html>
<html lang="zh" dir="ltr" class="client-nojs">
<head>
<title>std::priority_queue&lt;T,Container,Compare&gt;::priority_queue</title>
<meta charset="UTF-8">
<meta name="generator" content="MediaWiki 1.21.2">
<link rel="shortcut icon" href="../../../../common/favicon.ico">
<link rel="stylesheet" href="../../../../common/ext.css">
<meta name="ResourceLoaderDynamicStyles" content="">
<link rel="stylesheet" href="../../../../common/site_modules.css">
<style>a:lang(ar),a:lang(ckb),a:lang(fa),a:lang(kk-arab),a:lang(mzn),a:lang(ps),a:lang(ur){text-decoration:none}#toc{display:none}.editsection{display:none}
/* cache key: mwiki1-mwiki_zh_:resourceloader:filter:minify-css:7:15cea3ec788a65b5187d4018eed543bf */</style>

<script src="../../../../common/startup_scripts.js"></script>
<script>if(window.mw){
mw.config.set({"wgCanonicalNamespace":"","wgCanonicalSpecialPageName":false,"wgNamespaceNumber":0,"wgPageName":"cpp/container/priority_queue/priority_queue","wgTitle":"cpp/container/priority queue/priority queue","wgCurRevisionId":55890,"wgArticleId":1817,"wgIsArticle":true,"wgAction":"view","wgUserName":null,"wgUserGroups":["*"],"wgCategories":[],"wgBreakFrames":false,"wgPageContentLanguage":"zh","wgSeparatorTransformTable":["",""],"wgDigitTransformTable":["",""],"wgDefaultDateFormat":"zh","wgMonthNames":["","1月","2月","3月","4月","5月","6月","7月","8月","9月","10月","11月","12月"],"wgMonthNamesShort":["","1月","2月","3月","4月","5月","6月","7月","8月","9月","10月","11月","12月"],"wgRelevantPageName":"cpp/container/priority_queue/priority_queue","wgUserVariant":"zh","wgRestrictionEdit":[],"wgRestrictionMove":[]});
}</script><script>if(window.mw){
mw.loader.implement("user.options",function(){mw.user.options.set({"ccmeonemails":0,"cols":80,"date":"default","diffonly":0,"disablemail":0,"disablesuggest":0,"editfont":"default","editondblclick":0,"editsection":0,"editsectiononrightclick":0,"enotifminoredits":0,"enotifrevealaddr":0,"enotifusertalkpages":1,"enotifwatchlistpages":0,"extendwatchlist":0,"externaldiff":0,"externaleditor":0,"fancysig":0,"forceeditsummary":0,"gender":"unknown","hideminor":0,"hidepatrolled":0,"imagesize":2,"justify":0,"math":1,"minordefault":0,"newpageshidepatrolled":0,"nocache":0,"noconvertlink":0,"norollbackdiff":0,"numberheadings":0,"previewonfirst":0,"previewontop":1,"quickbar":5,"rcdays":7,"rclimit":50,"rememberpassword":0,"rows":25,"searchlimit":20,"showhiddencats":0,"showjumplinks":1,"shownumberswatching":1,"showtoc":0,"showtoolbar":1,"skin":"cppreference2","stubthreshold":0,"thumbsize":2,"underline":2,"uselivepreview":0,"usenewrc":0,"watchcreations":0,"watchdefault":0,"watchdeletion":0,
"watchlistdays":3,"watchlisthideanons":0,"watchlisthidebots":0,"watchlisthideliu":0,"watchlisthideminor":0,"watchlisthideown":0,"watchlisthidepatrolled":0,"watchmoves":0,"wllimit":250,"variant":"zh","language":"zh","searchNs0":true,"searchNs1":false,"searchNs2":false,"searchNs3":false,"searchNs4":false,"searchNs5":false,"searchNs6":false,"searchNs7":false,"searchNs8":false,"searchNs9":false,"searchNs10":false,"searchNs11":false,"searchNs12":false,"searchNs13":false,"searchNs14":false,"searchNs15":false,"gadget-MathJax":1,"gadget-ColiruCompiler":1});;},{},{});mw.loader.implement("user.tokens",function(){mw.user.tokens.set({"editToken":"+\\","patrolToken":false,"watchToken":false});;},{},{});
/* cache key: mwiki1-mwiki_zh_:resourceloader:filter:minify-js:7:258d7cd6aa9aa67dee25e01fb6a9e505 */
}</script>
<script>if(window.mw){
mw.loader.load(["mediawiki.page.startup","mediawiki.legacy.wikibits","mediawiki.legacy.ajax"]);
}</script>
<style type="text/css">/*<![CDATA[*/
.source-cpp {line-height: normal;}
.source-cpp li, .source-cpp pre {
	line-height: normal; border: 0px none white;
}
/**
 * GeSHi Dynamically Generated Stylesheet
 * --------------------------------------
 * Dynamically generated stylesheet for cpp
 * CSS class: source-cpp, CSS id: 
 * GeSHi (C) 2004 - 2007 Nigel McNie, 2007 - 2008 Benny Baumann
 * (http://qbnz.com/highlighter/ and http://geshi.org/)
 * --------------------------------------
 */
.cpp.source-cpp .de1, .cpp.source-cpp .de2 {font: normal normal 1em/1.2em monospace; margin:0; padding:0; background:none; vertical-align:top;}
.cpp.source-cpp  {font-family:monospace;}
.cpp.source-cpp .imp {font-weight: bold; color: red;}
.cpp.source-cpp li, .cpp.source-cpp .li1 {font-weight: normal; vertical-align:top;}
.cpp.source-cpp .ln {width:1px;text-align:right;margin:0;padding:0 2px;vertical-align:top;}
.cpp.source-cpp .li2 {font-weight: bold; vertical-align:top;}
.cpp.source-cpp .kw1 {color: #0000dd;}
.cpp.source-cpp .kw2 {color: #0000ff;}
.cpp.source-cpp .kw3 {color: #0000dd;}
.cpp.source-cpp .kw4 {color: #0000ff;}
.cpp.source-cpp .co1 {color: #909090;}
.cpp.source-cpp .co2 {color: #339900;}
.cpp.source-cpp .coMULTI {color: #ff0000; font-style: italic;}
.cpp.source-cpp .es0 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es1 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es2 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es3 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es4 {color: #008000; font-weight: bold;}
.cpp.source-cpp .es5 {color: #008000; font-weight: bold;}
.cpp.source-cpp .br0 {color: #008000;}
.cpp.source-cpp .sy0 {color: #008000;}
.cpp.source-cpp .sy1 {color: #000080;}
.cpp.source-cpp .sy2 {color: #000040;}
.cpp.source-cpp .sy3 {color: #000040;}
.cpp.source-cpp .sy4 {color: #008080;}
.cpp.source-cpp .st0 {color: #008000;}
.cpp.source-cpp .nu0 {color: #000080;}
.cpp.source-cpp .nu6 {color: #000080;}
.cpp.source-cpp .nu8 {color: #000080;}
.cpp.source-cpp .nu12 {color: #000080;}
.cpp.source-cpp .nu16 {color:#000080;}
.cpp.source-cpp .nu17 {color:#000080;}
.cpp.source-cpp .nu18 {color:#000080;}
.cpp.source-cpp .nu19 {color:#000080;}
.cpp.source-cpp .ln-xtra, .cpp.source-cpp li.ln-xtra, .cpp.source-cpp div.ln-xtra {background-color: #ffc;}
.cpp.source-cpp span.xtra { display:block; }

/*]]>*/
</style><style type="text/css">/*<![CDATA[*/
.source-text {line-height: normal;}
.source-text li, .source-text pre {
	line-height: normal; border: 0px none white;
}
/**
 * GeSHi Dynamically Generated Stylesheet
 * --------------------------------------
 * Dynamically generated stylesheet for text
 * CSS class: source-text, CSS id: 
 * GeSHi (C) 2004 - 2007 Nigel McNie, 2007 - 2008 Benny Baumann
 * (http://qbnz.com/highlighter/ and http://geshi.org/)
 * --------------------------------------
 */
.text.source-text .de1, .text.source-text .de2 {font: normal normal 1em/1.2em monospace; margin:0; padding:0; background:none; vertical-align:top;}
.text.source-text  {font-family:monospace;}
.text.source-text .imp {font-weight: bold; color: red;}
.text.source-text li, .text.source-text .li1 {font-weight: normal; vertical-align:top;}
.text.source-text .ln {width:1px;text-align:right;margin:0;padding:0 2px;vertical-align:top;}
.text.source-text .li2 {font-weight: bold; vertical-align:top;}
.text.source-text .ln-xtra, .text.source-text li.ln-xtra, .text.source-text div.ln-xtra {background-color: #ffc;}
.text.source-text span.xtra { display:block; }

/*]]>*/
</style><!--[if lt IE 7]><style type="text/css">body{behavior:url("/mwiki/skins/cppreference2/csshover.min.htc")}</style><![endif]--></head>
<body class="mediawiki ltr sitedir-ltr ns-0 ns-subject page-cpp_container_priority_queue_priority_queue skin-cppreference2 action-view cpp-navbar">
        <!-- header -->
        <!-- /header -->
        <!-- content -->
<div id="cpp-content-base">
            <div id="content">
                <a id="top"></a>
                <div id="mw-js-message" style="display:none;"></div>
                                <!-- firstHeading -->
<h1 id="firstHeading" class="firstHeading"><span style="font-size:0.7em; line-height:130%">std::priority_queue&lt;T,Container,Compare&gt;::</span>priority_queue</h1>
                <!-- /firstHeading -->
                <!-- bodyContent -->
                <div id="bodyContent">
                                        <!-- tagline -->
                    <div id="siteSub">来自cppreference.com</div>
                    <!-- /tagline -->
                                        <!-- subtitle -->
                    <div id="contentSub"><span class="subpages">&lt; <a href="../../../cpp.html" title="cpp">cpp</a>‎ | <a href="https://zh.cppreference.com/w/cpp/container" title="cpp/container">container</a>‎ | <a href="../priority_queue.html" title="cpp/container/priority queue">priority queue</a></span></div>
                    <!-- /subtitle -->
                                                            <!-- bodycontent -->
                    <div id="mw-content-text" lang="zh" dir="ltr" class="mw-content-ltr"><div class="t-navbar" style=""><div class="t-navbar-sep"> </div><div class="t-navbar-head"><a href="../../../cpp.html" title="cpp"> C++</a><div class="t-navbar-menu"><div><div><table class="t-nv-begin" cellpadding="0" style="line-height:1.1em;">
<tr class="t-nv"><td colspan="5"> <a href="../../language.html" title="cpp/language">语言</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../header.html" title="cpp/header">标准库头文件</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../freestanding.html" title="cpp/freestanding"> 自立与有宿主实现</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../named_req.html" title="cpp/named req">具名要求</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../utility.html#.E8.AF.AD.E8.A8.80.E6.94.AF.E6.8C.81" title="cpp/utility">语言支持库</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../concepts.html" title="cpp/concepts">概念库</a> <span class="t-mark-rev t-since-cxx20">(C++20)</span> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../error.html" title="cpp/error">诊断库</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../utility.html" title="cpp/utility">工具库</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../string.html" title="cpp/string">字符串库</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="https://zh.cppreference.com/w/cpp/container" title="cpp/container">容器库</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../iterator.html" title="cpp/iterator">迭代器库</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../ranges.html" title="cpp/ranges"> 范围库</a> <span class="t-mark-rev t-since-cxx20">(C++20)</span> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../algorithm.html" title="cpp/algorithm">算法库</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../numeric.html" title="cpp/numeric">数值库</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../io.html" title="cpp/io">输入/输出库</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../locale.html" title="cpp/locale">本地化库</a> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../regex.html" title="cpp/regex">正则表达式库</a> <span class="t-mark-rev t-since-cxx11">(C++11)</span> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../atomic.html" title="cpp/atomic">原子操作库</a> <span class="t-mark-rev t-since-cxx11">(C++11)</span> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../thread.html" title="cpp/thread">线程支持库</a> <span class="t-mark-rev t-since-cxx11">(C++11)</span> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../filesystem.html" title="cpp/filesystem">文件系统库</a> <span class="t-mark-rev t-since-cxx17">(C++17)</span> </td></tr>
<tr class="t-nv"><td colspan="5"> <a href="../../experimental.html" title="cpp/experimental">技术规范</a> </td></tr>
</table></div><div></div></div></div></div><div class="t-navbar-sep"> </div><div class="t-navbar-head"><a href="https://zh.cppreference.com/w/cpp/container" title="cpp/container">容器库</a><div class="t-navbar-menu"><div><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../array.html" title="cpp/container/array"><span class="t-lines"><span>array</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../vector.html" title="cpp/container/vector"><span class="t-lines"><span>vector</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../deque.html" title="cpp/container/deque"><span class="t-lines"><span>deque</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../forward_list.html" title="cpp/container/forward list"><span class="t-lines"><span>forward_list</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../list.html" title="cpp/container/list"><span class="t-lines"><span>list</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../set.html" title="cpp/container/set"><span class="t-lines"><span>set</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../multiset.html" title="cpp/container/multiset"><span class="t-lines"><span>multiset</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../map.html" title="cpp/container/map"><span class="t-lines"><span>map</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../multimap.html" title="cpp/container/multimap"><span class="t-lines"><span>multimap</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../unordered_set.html" title="cpp/container/unordered set"><span class="t-lines"><span>unordered_set</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../unordered_multiset.html" title="cpp/container/unordered multiset"><span class="t-lines"><span>unordered_multiset</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../unordered_map.html" title="cpp/container/unordered map"><span class="t-lines"><span>unordered_map</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../unordered_multimap.html" title="cpp/container/unordered multimap"><span class="t-lines"><span>unordered_multimap</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx11">(C++11)</span></span></span></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../stack.html" title="cpp/container/stack"><span class="t-lines"><span>stack</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../queue.html" title="cpp/container/queue"><span class="t-lines"><span>queue</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../priority_queue.html" title="cpp/container/priority queue"><span class="t-lines"><span>priority_queue</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="../span.html" title="cpp/container/span"><span class="t-lines"><span>span</span></span></a></div><div><span class="t-lines"><span><span class="t-mark-rev t-since-cxx20">(C++20)</span></span></span></div></div></td></tr>
</table></div><div></div></div></div></div><div class="t-navbar-sep"> </div><div class="t-navbar-head"><code><a href="../priority_queue.html" title="cpp/container/priority queue">std::priority_queue</a></code><div class="t-navbar-menu"><div><div><table class="t-nv-begin" cellpadding="0" style="">
<tr class="t-nv-h1"><td colspan="5">成员函数</td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><strong class="selflink"><span class="t-lines"><span>priority_queue::priority_queue</span></span></strong></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="~priority_queue.html" title="cpp/container/priority queue/~priority queue"><span class="t-lines"><span>priority_queue::~priority_queue</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="operator%3D.html" title="cpp/container/priority queue/operator="><span class="t-lines"><span>priority_queue::operator=</span></span></a></div></div></td></tr>
<tr class="t-nv-h2"><td colspan="5">元素访问</td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="top.html" title="cpp/container/priority queue/top"><span class="t-lines"><span>priority_queue::top</span></span></a></div></div></td></tr>
<tr class="t-nv-h2"><td colspan="5">容量</td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="empty.html" title="cpp/container/priority queue/empty"><span class="t-lines"><span>priority_queue::empty</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="size.html" title="cpp/container/priority queue/size"><span class="t-lines"><span>priority_queue::size</span></span></a></div></div></td></tr>
<tr class="t-nv-h2"><td colspan="5">修改器</td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="push.html" title="cpp/container/priority queue/push"><span class="t-lines"><span>priority_queue::push</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="emplace.html" title="cpp/container/priority queue/emplace"><span class="t-lines"><span>priority_queue::emplace</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="pop.html" title="cpp/container/priority queue/pop"><span class="t-lines"><span>priority_queue::pop</span></span></a></div></div></td></tr>
<tr class="t-nv"><td colspan="5"><div class="t-nv-ln-table"><div><a href="https://zh.cppreference.com/w/cpp/container/priority_queue/swap" title="cpp/container/priority queue/swap"><span class="t-lines"><span>priority_queue::swap</span></span></a></div></div></td></tr>
<tr class="t-nv-h1"><td colspan="5"> <a href="deduction_guides.html" title="cpp/container/priority queue/deduction guides">推导指引</a><span class="t-mark-rev t-since-cxx17">(C++17)</span></td></tr>
</table></div><div></div></div></div></div><div class="t-navbar-sep"> </div></div>
<table class="t-dcl-begin"><tbody>
<tr class="t-dcl t-since-cxx11">
<td> <div><span class="mw-geshi cpp source-cpp">priority_queue<span class="br0">(</span><span class="br0">)</span> <span class="sy4">:</span> priority_queue<span class="br0">(</span>Compare<span class="br0">(</span><span class="br0">)</span>, Container<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span></span></div></td>
<td> (1) </td>
<td> <span class="t-mark-rev t-since-cxx11">(C++11 起)</span> </td>
</tr>
<tr class="t-dcl t-since-cxx11">
<td> <div><span class="mw-geshi cpp source-cpp"><span class="kw1">explicit</span> priority_queue<span class="br0">(</span><span class="kw4">const</span> Compare<span class="sy3">&amp;</span> compare<span class="br0">)</span> <br>
    <span class="sy4">:</span> priority_queue<span class="br0">(</span>compare, Container<span class="br0">(</span><span class="br0">)</span><span class="br0">)</span> <span class="br0">{</span> <span class="br0">}</span></span></div></td>
<td> (2) </td>
<td> <span class="t-mark-rev t-since-cxx11">(C++11 起)</span> </td>
</tr>
</tbody>
<tbody class="t-dcl-rev t-dcl-rev-num"><tr class="t-dcl-rev-aux">
<td></td>
<td rowspan="142">(3)</td>
<td></td>
</tr>
<tr class="t-dcl t-until-cxx11">
<td> <div><span class="mw-geshi cpp source-cpp"><span class="kw1">explicit</span> priority_queue<span class="br0">(</span> <span class="kw4">const</span> Compare<span class="sy3">&amp;</span> compare <span class="sy1">=</span> Compare<span class="br0">(</span><span class="br0">)</span>,<br>
                         <span class="kw4">const</span> Container<span class="sy3">&amp;</span> cont <span class="sy1">=</span> Container<span class="br0">(</span><span class="br0">)</span> <span class="br0">)</span><span class="sy4">;</span></span></div></td>
<td class="t-dcl-nopad">  </td>
<td> <span class="t-mark-rev t-until-cxx11">(C++11 前)</span> </td>
</tr>
<tr class="t-dcl t-since-cxx11">
<td> <div><span class="mw-geshi cpp source-cpp">priority_queue<span class="br0">(</span> <span class="kw4">const</span> Compare<span class="sy3">&amp;</span> compare, <span class="kw4">const</span> Container<span class="sy3">&amp;</span> cont <span class="br0">)</span><span class="sy4">;</span></span></div></td>
<td class="t-dcl-nopad">  </td>
<td> <span class="t-mark-rev t-since-cxx11">(C++11 起)</span> </td>
</tr>
</tbody><tbody>
<tr class="t-dcl t-since-cxx11">
<td> <div><span class="mw-geshi cpp source-cpp">priority_queue<span class="br0">(</span> <span class="kw4">const</span> Compare<span class="sy3">&amp;</span> compare, Container<span class="sy3">&amp;&amp;</span> cont <span class="br0">)</span><span class="sy4">;</span></span></div></td>
<td> (4) </td>
<td> <span class="t-mark-rev t-since-cxx11">(C++11 起)</span> </td>
</tr>
<tr class="t-dcl">
<td> <div><span class="mw-geshi cpp source-cpp">priority_queue<span class="br0">(</span> <span class="kw4">const</span> priority_queue<span class="sy3">&amp;</span> other <span class="br0">)</span><span class="sy4">;</span></span></div></td>
<td> (5) </td>
<td class="t-dcl-nopad">  </td>
</tr>
<tr class="t-dcl t-since-cxx11">
<td> <div><span class="mw-geshi cpp source-cpp">priority_queue<span class="br0">(</span> priority_queue<span class="sy3">&amp;&amp;</span> other <span class="br0">)</span><span class="sy4">;</span></span></div></td>
<td> (6) </td>
<td> <span class="t-mark-rev t-since-cxx11">(C++11 起)</span> </td>
</tr>
<tr class="t-dcl t-since-cxx11">
<td> <div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1">&lt;</span> <span class="kw1">class</span> Alloc <span class="sy1">&gt;</span> <br>
<span class="kw1">explicit</span> priority_queue<span class="br0">(</span> <span class="kw4">const</span> Alloc<span class="sy3">&amp;</span> alloc <span class="br0">)</span><span class="sy4">;</span></span></div></td>
<td> (7) </td>
<td> <span class="t-mark-rev t-since-cxx11">(C++11 起)</span> </td>
</tr>
<tr class="t-dcl t-since-cxx11">
<td> <div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1">&lt;</span> <span class="kw1">class</span> Alloc <span class="sy1">&gt;</span> <br>
priority_queue<span class="br0">(</span> <span class="kw4">const</span> Compare<span class="sy3">&amp;</span> compare, <span class="kw4">const</span> Alloc<span class="sy3">&amp;</span> alloc <span class="br0">)</span><span class="sy4">;</span></span></div></td>
<td> (8) </td>
<td> <span class="t-mark-rev t-since-cxx11">(C++11 起)</span> </td>
</tr>
<tr class="t-dcl t-since-cxx11">
<td> <div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1">&lt;</span> <span class="kw1">class</span> Alloc <span class="sy1">&gt;</span> <br>
<p>priority_queue<span class="br0">(</span> <span class="kw4">const</span> Compare<span class="sy3">&amp;</span> compare, <span class="kw4">const</span> Container<span class="sy3">&amp;</span> cont,<br>
</p>
                <span class="kw4">const</span> Alloc<span class="sy3">&amp;</span> alloc <span class="br0">)</span><span class="sy4">;</span></span></div></td>
<td> (9) </td>
<td> <span class="t-mark-rev t-since-cxx11">(C++11 起)</span> </td>
</tr>
<tr class="t-dcl t-since-cxx11">
<td> <div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1">&lt;</span> <span class="kw1">class</span> Alloc <span class="sy1">&gt;</span> <br>
<p>priority_queue<span class="br0">(</span> <span class="kw4">const</span> Compare<span class="sy3">&amp;</span> compare, Container<span class="sy3">&amp;&amp;</span> cont,<br>
</p>
                <span class="kw4">const</span> Alloc<span class="sy3">&amp;</span> alloc <span class="br0">)</span><span class="sy4">;</span></span></div></td>
<td> (10) </td>
<td> <span class="t-mark-rev t-since-cxx11">(C++11 起)</span> </td>
</tr>
<tr class="t-dcl t-since-cxx11">
<td> <div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1">&lt;</span> <span class="kw1">class</span> Alloc <span class="sy1">&gt;</span> <br>
priority_queue<span class="br0">(</span> <span class="kw4">const</span> priority_queue<span class="sy3">&amp;</span> other, <span class="kw4">const</span> Alloc<span class="sy3">&amp;</span> alloc <span class="br0">)</span><span class="sy4">;</span></span></div></td>
<td> (11) </td>
<td> <span class="t-mark-rev t-since-cxx11">(C++11 起)</span> </td>
</tr>
<tr class="t-dcl t-since-cxx11">
<td> <div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1">&lt;</span> <span class="kw1">class</span> Alloc <span class="sy1">&gt;</span> <br>
priority_queue<span class="br0">(</span> priority_queue<span class="sy3">&amp;&amp;</span> other, <span class="kw4">const</span> Alloc<span class="sy3">&amp;</span> alloc <span class="br0">)</span><span class="sy4">;</span></span></div></td>
<td> (12) </td>
<td> <span class="t-mark-rev t-since-cxx11">(C++11 起)</span> </td>
</tr>
<tr class="t-dcl t-since-cxx11">
<td> <div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1">&lt;</span> <span class="kw1">class</span> InputIt <span class="sy1">&gt;</span><br>
<p>priority_queue<span class="br0">(</span> InputIt first, InputIt last,<br>
</p>
                <span class="kw4">const</span> Compare<span class="sy3">&amp;</span> compare, <span class="kw4">const</span> Container<span class="sy3">&amp;</span> cont <span class="br0">)</span><span class="sy4">;</span></span></div></td>
<td> (13) </td>
<td> <span class="t-mark-rev t-since-cxx11">(C++11 起)</span> </td>
</tr>
<tr class="t-dcl t-since-cxx11">
<td> <div><span class="mw-geshi cpp source-cpp"><span class="kw1">template</span><span class="sy1">&lt;</span> <span class="kw1">class</span> InputIt <span class="sy1">&gt;</span><br>
<p>priority_queue<span class="br0">(</span> InputIt first, InputIt last,<br>
                <span class="kw4">const</span> Compare<span class="sy3">&amp;</span> compare <span class="sy1">=</span> Compare<span class="br0">(</span><span class="br0">)</span>, <br>
</p>
                Container<span class="sy3">&amp;&amp;</span> cont <span class="sy1">=</span> Container<span class="br0">(</span><span class="br0">)</span> <span class="br0">)</span><span class="sy4">;</span></span></div></td>
<td> (14) </td>
<td> <span class="t-mark-rev t-since-cxx11">(C++11 起)</span> </td>
</tr>
<tr class="t-dcl-sep"><td></td><td></td><td></td></tr>
</tbody></table>
<p>从多种数据源构造容器适配器的底层容器。
</p>
<div class="t-li1"><span class="t-li">1)</span> 默认构造函数。值初始化底层容器。</div>
<div class="t-li1"><span class="t-li">2)</span> 用 <code>compare</code> 的内容复制构造比较函数对象 <code>comp</code> 。值初始化底层容器 <code>c</code> 。</div>
<div class="t-li1"><span class="t-li">3)</span> 用 <code>cont</code> 的内容复制构造底层容器 <code>c</code> 。用 <code>compare</code> 的内容复制构造比较函数对象 <code>comp</code> 。调用 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="../../algorithm/make_heap.html"><span class="kw1636">std::<span class="me2">make_heap</span></span></a><span class="br0">(</span>c.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, comp<span class="br0">)</span></span></span> 。<span class="t-rev-inl t-until-cxx11"><span>此亦为默认构造函数。</span> <span><span class="t-mark-rev t-until-cxx11">(C++11 前)</span></span></span></div>
<div class="t-li1"><span class="t-li">4)</span> 用 <span class="t-c"><span class="mw-geshi cpp source-cpp">std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>cont<span class="br0">)</span></span></span> 移动构造底层容器 <code>c</code> 。以 <code>compare</code> 的内容复制构造比较函数对象 <code>comp</code> 。调用 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="../../algorithm/make_heap.html"><span class="kw1636">std::<span class="me2">make_heap</span></span></a><span class="br0">(</span>c.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, comp<span class="br0">)</span></span></span> 。</div>
<div class="t-li1"><span class="t-li">5)</span> 复制构造函数。以 <span class="t-c"><span class="mw-geshi cpp source-cpp">other.<span class="me1">c</span></span></span> 的内容复制构造底层容器。以 <span class="t-c"><span class="mw-geshi cpp source-cpp">other.<span class="me1">comp</span></span></span> 复制构造比较函数对象。 <span class="t-mark">(隐式声明)</span></div>
<div class="t-li1"><span class="t-li">6)</span> 移动构造函数。以 <span class="t-c"><span class="mw-geshi cpp source-cpp">std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>other.<span class="me1">c</span><span class="br0">)</span></span></span> 构造底层容器。以 <span class="t-c"><span class="mw-geshi cpp source-cpp">std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>other.<span class="me1">comp</span><span class="br0">)</span></span></span> 构造比较函数对象。 <span class="t-mark">(隐式声明)</span></div>
<div class="t-li1"><span class="t-li">7-12)</span> 仅若 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="../../memory/uses_allocator.html"><span class="kw704">std::<span class="me2">uses_allocator</span></span></a><span class="sy1">&lt;</span>container_type, Alloc<span class="sy1">&gt;</span><span class="sy4">::</span><span class="me2">value</span> <span class="sy1">==</span> <span class="kw2">true</span></span></span> ，即若底层容器是具分配器容器（对所有标准库容器为真），才定义下列构造函数。</div>
<div class="t-li2"><span class="t-li">7)</span> 以 <code>alloc</code> 为分配器构造底层容器。等效地调用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c<span class="br0">(</span>alloc<span class="br0">)</span></span></span> 。值初始化 <code>comp</code> 。</div>
<div class="t-li2"><span class="t-li">8)</span> 以 <code>alloc</code> 为分配器构造底层容器。等效地调用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c<span class="br0">(</span>alloc<span class="br0">)</span></span></span> 。从 <code>compare</code> 复制构造 <code>comp</code> 。</div>
<div class="t-li2"><span class="t-li">9)</span> 用 <code>cont</code> 的内容，以 <code>alloc</code> 为分配器构造底层容器，如同用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c<span class="br0">(</span>cont, alloc<span class="br0">)</span></span></span> 。从 <code>compare</code> 复制构造 <code>comp</code> 。然后调用 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="../../algorithm/make_heap.html"><span class="kw1636">std::<span class="me2">make_heap</span></span></a><span class="br0">(</span>c.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, comp<span class="br0">)</span></span></span> 。 </div>
<div class="t-li2"><span class="t-li">10)</span> 用 <code>cont</code> 的内容，以 <code>alloc</code> 为分配器并以移动语义构造底层容器，如同用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c<span class="br0">(</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>cont<span class="br0">)</span>, alloc<span class="br0">)</span></span></span> 。从 <code>compare</code> 复制构造 <code>comp</code> 。然后调用 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="../../algorithm/make_heap.html"><span class="kw1636">std::<span class="me2">make_heap</span></span></a><span class="br0">(</span>c.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, comp<span class="br0">)</span></span></span> 。</div>
<div class="t-li2"><span class="t-li">11)</span> 用 <code>other.c</code> 的内容，以 <code>alloc</code> 为分配器构造底层容器。等效地调用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c<span class="br0">(</span>other.<span class="me1">c</span>, alloc<span class="br0">)</span></span></span> 。从 <code>other.comp</code> 复制构造 <code>comp</code> 。</div>
<div class="t-li2"><span class="t-li">12)</span> 用 <code>other</code> 的内容，同时以 <code>alloc</code> 为分配器构造适配器。等效地调用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c<span class="br0">(</span>std<span class="sy4">::</span><span class="me2">move</span><span class="br0">(</span>other.<span class="me1">c</span><span class="br0">)</span>, alloc<span class="br0">)</span></span></span> 。从 <code>other.comp</code> 移动构造 <code>comp</code> 。</div>
<div class="t-li1"><span class="t-li">13)</span> 从 <code>cont</code> 复制构造 <code>c</code> 并从 <code>compare</code> 复制构造 <code>comp</code> 。然后调用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c.<span class="me1">insert</span><span class="br0">(</span>c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, first, last<span class="br0">)</span><span class="sy4">;</span></span></span> ，再调用 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="../../algorithm/make_heap.html"><span class="kw1636">std::<span class="me2">make_heap</span></span></a><span class="br0">(</span>c.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, comp<span class="br0">)</span><span class="sy4">;</span></span></span> 。</div>
<div class="t-li1"><span class="t-li">14)</span> 从 <code>std::move(cont)</code> 移动构造 <code>c</code> 并从 <code>std::move(compare)</code> 移动构造 <code>comp</code> 。然后调用 <span class="t-c"><span class="mw-geshi cpp source-cpp">c.<span class="me1">insert</span><span class="br0">(</span>c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, first, last<span class="br0">)</span><span class="sy4">;</span></span></span> ，再调用 <span class="t-c"><span class="mw-geshi cpp source-cpp"><a href="../../algorithm/make_heap.html"><span class="kw1636">std::<span class="me2">make_heap</span></span></a><span class="br0">(</span>c.<span class="me1">begin</span><span class="br0">(</span><span class="br0">)</span>, c.<span class="me1">end</span><span class="br0">(</span><span class="br0">)</span>, comp<span class="br0">)</span><span class="sy4">;</span></span></span> 。</div>
<h3><span class="mw-headline" id=".E5.8F.82.E6.95.B0">参数</span></h3>
<table class="t-par-begin">


<tr class="t-par">
<td>  alloc
</td>
<td> -
</td>
<td> 用于底层容器所有内存分配的分配器
</td></tr>
<tr class="t-par">
<td>  other
</td>
<td> -
</td>
<td> 用作源初始化底层容器的另一容器适配器
</td></tr>
<tr class="t-par">
<td>  cont
</td>
<td> -
</td>
<td> 用作源初始化底层容器的容器
</td></tr>
<tr class="t-par">
<td>  compare
</td>
<td> -
</td>
<td> 用于初始化底层比较函数对象的比较函数对象
</td></tr>
<tr class="t-par">
<td>  first, last
</td>
<td> -
</td>
<td> 要初始化的元素范围
</td></tr>
<tr class="t-par-hitem">
<td colspan="3"> 类型要求
</td></tr>
<tr class="t-par-req">
<td colspan="3"> -<div class="spacer"></div><code>Alloc</code> 必须满足<a href="../../named_req/Allocator.html" title="cpp/named req/Allocator"><i>分配器</i> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Allocator)</span> </a> 的要求。
</td></tr>
<tr class="t-par-req">
<td colspan="3"> -<div class="spacer"></div><code>Container</code> 必须满足<a href="../../named_req/Container.html" title="cpp/named req/Container"><i>容器</i> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(Container)</span> </a> 的要求。仅若 <code>Container</code> 满足<a href="../../named_req/AllocatorAwareContainer.html" title="cpp/named req/AllocatorAwareContainer"><i>具分配器容器</i> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(AllocatorAwareContainer)</span> </a>的要求才定义构造函数 (5-10)
</td></tr>
<tr class="t-par-req">
<td colspan="3"> -<div class="spacer"></div><code>InputIt</code> 必须满足<a href="../../named_req/InputIterator.html" title="cpp/named req/InputIterator"><i>遗留输入迭代器</i> <span style="font-family: Georgia, 'DejaVu Serif', serif; font-style:italic">(LegacyInputIterator)</span> </a> 的要求。
</td></tr></table>
<h3><span class="mw-headline" id=".E5.A4.8D.E6.9D.82.E5.BA.A6">复杂度</span></h3>
<div class="t-li1"><span class="t-li">1-2)</span> 常数。</div>
<div class="t-li1"><span class="t-li">3,5)</span> <span class="texhtml" style="white-space: nowrap;">O(N)</span> 次比较，其中 <span class="texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> 。</div>
<div class="t-li1"><span class="t-li"></span> 另外，调用 <span class="texhtml" style="white-space: nowrap;">O(N)</span> 次 <code>value_type</code> 的构造函数，其中 <span class="texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> 。</div>
<div class="t-li1"><span class="t-li">4)</span> <span class="texhtml" style="white-space: nowrap;">O(N)</span> 次比较，其中 <span class="texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> 。</div>
<div class="t-li1"><span class="t-li">6-8)</span> 常数。</div>
<div class="t-li1"><span class="t-li">9)</span> <span class="texhtml" style="white-space: nowrap;">O(N)</span> 次比较，其中 <span class="texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> 。</div>
<div class="t-li1"><span class="t-li"></span> 另外，调用 <span class="texhtml" style="white-space: nowrap;">O(N)</span> 次 <code>value_type</code> 的构造函数，其中 <span class="texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> 。</div>
<div class="t-li1"><span class="t-li">10)</span> <span class="texhtml" style="white-space: nowrap;">O(N)</span> 次比较，其中 <span class="texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> 。</div>
<div class="t-li1"><span class="t-li">11)</span> 与 <code>other</code> 的大小成线性。</div>
<div class="t-li1"><span class="t-li">12)</span> 常数。</div>
<div class="t-li1"><span class="t-li">13)</span> <span class="texhtml" style="white-space: nowrap;">O(N)</span> 次比较，其中 <span class="texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy2">+</span> <a href="../../iterator/distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first, last<span class="br0">)</span></span></span> 。</div>
<div class="t-li1"><span class="t-li"></span> 另外，调用 <span class="texhtml" style="white-space: nowrap;">O(N)</span> 次 <code>value_type</code> 的构造函数，其中 <span class="texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span></span></span> 。</div>
<div class="t-li1"><span class="t-li">14)</span> <span class="texhtml" style="white-space: nowrap;">O(N)</span> 次比较，其中 <span class="texhtml" style="white-space: nowrap;">N</span> 为 <span class="t-c"><span class="mw-geshi cpp source-cpp">cont.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy2">+</span> <a href="../../iterator/distance.html"><span class="kw673">std::<span class="me2">distance</span></span></a><span class="br0">(</span>first, last<span class="br0">)</span></span></span> 。</div>
<h3><span class="mw-headline" id=".E7.BC.BA.E9.99.B7.E6.8A.A5.E5.91.8A">缺陷报告</span></h3>
<p>下列更改行为的缺陷报告追溯地应用于以前出版的 C++ 标准。
</p>
<table class="dsctable" style="font-size:0.8em">
<tr>
<th> DR
</th>
<th> 应用于
</th>
<th> 出版时的行为
</th>
<th> 正确行为
</th></tr>
<tr>
<td> <a rel="nofollow" class="external text" href="https://wg21.link/P0935R0">P0935R0</a>
</td>
<td> C++11
</td>
<td> 默认构造函数和构造函数 <span class="t-v">(4)</span> 曾为 explicit
</td>
<td> 使之为隐式
</td></tr></table>
<h3><span class="mw-headline" id=".E7.A4.BA.E4.BE.8B">示例</span></h3>
<div class="t-example"><div class="t-example-live-link"><div class="coliru-btn coliru-btn-run-init">运行此代码</div></div>
<div dir="ltr" class="mw-geshi" style="text-align: left;"><div class="cpp source-cpp"><pre class="de1"><span class="co2">#include &lt;queue&gt;</span>
<span class="co2">#include &lt;vector&gt;</span>
<span class="co2">#include &lt;iostream&gt;</span>
<span class="co2">#include &lt;functional&gt;</span>
 
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
<span class="br0">{</span>
    <a href="../priority_queue.html"><span class="kw1299">std::<span class="me2">priority_queue</span></span></a><span class="sy1">&lt;</span><span class="kw4">int</span><span class="sy1">&gt;</span> c1<span class="sy4">;</span>
    c1.<span class="me1">push</span><span class="br0">(</span><span class="nu0">5</span><span class="br0">)</span><span class="sy4">;</span>
    <a href="../../io/cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1">&lt;&lt;</span> c1.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1">&lt;&lt;</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
 
    <a href="../priority_queue.html"><span class="kw1299">std::<span class="me2">priority_queue</span></span></a><span class="sy1">&lt;</span><span class="kw4">int</span><span class="sy1">&gt;</span> c2<span class="br0">(</span>c1<span class="br0">)</span><span class="sy4">;</span>
    <a href="../../io/cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1">&lt;&lt;</span> c2.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1">&lt;&lt;</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
 
    <a href="../vector.html"><span class="kw1269">std::<span class="me2">vector</span></span></a><span class="sy1">&lt;</span><span class="kw4">int</span><span class="sy1">&gt;</span> vec<span class="sy1">=</span><span class="br0">{</span><span class="nu0">3</span>, <span class="nu0">1</span>, <span class="nu0">4</span>, <span class="nu0">1</span>, <span class="nu0">5</span><span class="br0">}</span><span class="sy4">;</span>
    <a href="../priority_queue.html"><span class="kw1299">std::<span class="me2">priority_queue</span></span></a><span class="sy1">&lt;</span><span class="kw4">int</span><span class="sy1">&gt;</span> c3<span class="br0">(</span><a href="../../utility/functional/less.html"><span class="kw1039">std::<span class="me2">less</span></span></a><span class="sy1">&lt;</span><span class="kw4">int</span><span class="sy1">&gt;</span><span class="br0">(</span><span class="br0">)</span>, vec<span class="br0">)</span><span class="sy4">;</span>
    <a href="../../io/cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1">&lt;&lt;</span> c3.<span class="me1">size</span><span class="br0">(</span><span class="br0">)</span> <span class="sy1">&lt;&lt;</span> <span class="st0">'<span class="es1">\n</span>'</span><span class="sy4">;</span>
<span class="br0">}</span></pre></div></div>
<p>输出：
</p>
<div dir="ltr" class="mw-geshi" style="text-align: left;"><div class="text source-text"><pre class="de1">1
1
5</pre></div></div> 
</div>
<h3><span class="mw-headline" id=".E5.B8.A6.E5.AE.9A.E5.88.B6.E6.AF.94.E8.BE.83.E5.99.A8.E7.9A.84.E7.A4.BA.E4.BE.8B">带定制比较器的示例</span></h3>
<div class="t-example"><div class="t-example-live-link"><div class="coliru-btn coliru-btn-run-init">运行此代码</div></div>
<div dir="ltr" class="mw-geshi" style="text-align: left;"><div class="cpp source-cpp"><pre class="de1"><span class="co2">#include &lt;iostream&gt;</span>
<span class="co2">#include &lt;queue&gt;</span>
<span class="co2">#include &lt;vector&gt;</span>
<span class="co2">#include &lt;utility&gt;</span>
 
<span class="kw1">using</span> my_pair_t <span class="sy1">=</span> <a href="../../utility/pair.html"><span class="kw1096">std::<span class="me2">pair</span></span></a><span class="sy1">&lt;</span>size_t,<span class="kw4">bool</span><span class="sy1">&gt;</span><span class="sy4">;</span>
 
<span class="kw1">using</span> my_container_t <span class="sy1">=</span> <a href="../vector.html"><span class="kw1269">std::<span class="me2">vector</span></span></a><span class="sy1">&lt;</span>my_pair_t<span class="sy1">&gt;</span><span class="sy4">;</span>
 
<span class="kw4">int</span> main<span class="br0">(</span><span class="br0">)</span>
<span class="br0">{</span>
    <span class="kw4">auto</span> my_comp <span class="sy1">=</span>
        <span class="br0">[</span><span class="br0">]</span><span class="br0">(</span><span class="kw4">const</span> my_pair_t<span class="sy3">&amp;</span> e1, <span class="kw4">const</span> my_pair_t<span class="sy3">&amp;</span> e2<span class="br0">)</span> 
        <span class="br0">{</span> <span class="kw1">return</span> e1.<span class="me1">first</span> <span class="sy1">&gt;</span> e2.<span class="me1">first</span><span class="sy4">;</span> <span class="br0">}</span><span class="sy4">;</span>
    <a href="../priority_queue.html"><span class="kw1299">std::<span class="me2">priority_queue</span></span></a><span class="sy1">&lt;</span>my_pair_t,
                        my_container_t,
                        decltype<span class="br0">(</span>my_comp<span class="br0">)</span><span class="sy1">&gt;</span> queue<span class="br0">(</span>my_comp<span class="br0">)</span><span class="sy4">;</span>
    queue.<span class="me1">push</span><span class="br0">(</span><a href="../../utility/pair/make_pair.html"><span class="kw1097">std::<span class="me2">make_pair</span></span></a><span class="br0">(</span><span class="nu0">5</span>, <span class="kw2">true</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
    queue.<span class="me1">push</span><span class="br0">(</span><a href="../../utility/pair/make_pair.html"><span class="kw1097">std::<span class="me2">make_pair</span></span></a><span class="br0">(</span><span class="nu0">3</span>, <span class="kw2">false</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
    queue.<span class="me1">push</span><span class="br0">(</span><a href="../../utility/pair/make_pair.html"><span class="kw1097">std::<span class="me2">make_pair</span></span></a><span class="br0">(</span><span class="nu0">7</span>, <span class="kw2">true</span><span class="br0">)</span><span class="br0">)</span><span class="sy4">;</span>
    <a href="../../io/cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1">&lt;&lt;</span> <a href="../../io/manip/boolalpha.html"><span class="kw1764">std::<span class="me2">boolalpha</span></span></a><span class="sy4">;</span>
    <span class="kw1">while</span><span class="br0">(</span><span class="sy3">!</span>queue.<span class="me1">empty</span><span class="br0">(</span><span class="br0">)</span><span class="br0">)</span> 
    <span class="br0">{</span>
        <span class="kw4">const</span> <span class="kw4">auto</span><span class="sy3">&amp;</span> p <span class="sy1">=</span> queue.<span class="me1">top</span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span>
        <a href="../../io/cout.html"><span class="kw1758">std::<span class="me2">cout</span></span></a> <span class="sy1">&lt;&lt;</span> p.<span class="me1">first</span> <span class="sy1">&lt;&lt;</span> <span class="st0">" "</span> <span class="sy1">&lt;&lt;</span> p.<span class="me1">second</span> <span class="sy1">&lt;&lt;</span> <span class="st0">"<span class="es1">\n</span>"</span><span class="sy4">;</span>
        queue.<span class="me1">pop</span><span class="br0">(</span><span class="br0">)</span><span class="sy4">;</span>
    <span class="br0">}</span>
<span class="br0">}</span></pre></div></div>
<p>输出：
</p>
<div dir="ltr" class="mw-geshi" style="text-align: left;"><div class="text source-text"><pre class="de1">3 false
5 true
7 true</pre></div></div> 
</div>
<h3><span class="mw-headline" id=".E5.8F.82.E9.98.85">参阅</span></h3>
<table class="t-dsc-begin">

<tr class="t-dsc">
<td>  <div class="t-dsc-member-div"><div><a href="operator%3D.html" title="cpp/container/priority queue/operator="> <span class="t-lines"><span>operator=</span></span></a></div></div>
</td>
<td>   赋值给容器适配器 <br> <span class="t-mark">(公开成员函数)</span> </td></tr>
</table>

<!-- 
NewPP limit report
Preprocessor visited node count: 6453/1000000
Preprocessor generated node count: 12875/1000000
Post‐expand include size: 99323/2097152 bytes
Template argument size: 24560/2097152 bytes
Highest expansion depth: 25/40
Expensive parser function count: 0/100
-->

<!-- Saved in parser cache with key mwiki1-mwiki_zh_:pcache:idhash:1817-0!*!0!!zh!*!zh!* and timestamp 20200207103811 -->
</div>                    <!-- /bodycontent -->
                                        <!-- printfooter -->
                    <div class="printfooter">
                    来自“<a href="https://zh.cppreference.com/mwiki/index.php?title=cpp/container/priority_queue/priority_queue&amp;oldid=55890">https://zh.cppreference.com/mwiki/index.php?title=cpp/container/priority_queue/priority_queue&amp;oldid=55890</a>”                    </div>
                    <!-- /printfooter -->
                                                            <!-- catlinks -->
                    <!-- /catlinks -->
                                                            <div class="visualClear"></div>
                    <!-- debughtml -->
                                        <!-- /debughtml -->
                </div>
                <!-- /bodyContent -->
            </div>
        </div>
        <!-- /content -->
        <!-- footer -->
        <div id="cpp-footer-base" class="noprint">
            <div id="footer">
                        <div id="cpp-navigation">
            <h5>导航</h5>
            <ul><li><a href="https://zh.cppreference.com/w/cpp/container/priority_queue/priority_queue">Online version</a></li><li>Offline version retrieved 2020-03-14 18:00.</li></ul></div>
                        <ul id="footer-info">
                                    <li id="footer-info-lastmod"> 本页面最后修改于2018年6月16日 (星期六) 08:14。</li>
                                    <li id="footer-info-viewcount">此页面已被浏览过5,456次。</li>
                            </ul>
                    </div>
        </div>
        <!-- /footer -->
        <script>if(window.mw){
mw.loader.state({"site":"loading","user":"missing","user.groups":"ready"});
}</script>
<script src="../../../../common/skin_scripts.js"></script>
<script>if(window.mw){
mw.loader.load(["mediawiki.action.view.postEdit","mediawiki.user","mediawiki.page.ready","mediawiki.searchSuggest","mediawiki.hidpi","ext.gadget.MathJax","ext.gadget.ColiruCompiler"], null, true);
}</script>
<script src="../../../../common/site_scripts.js"></script>
<script type="text/javascript">
var _gaq = _gaq || [];
_gaq.push(['_setAccount', 'UA-2828341-1']);
_gaq.push(['_setDomainName', 'cppreference.com']);
_gaq.push(['_trackPageview']);
</script><!-- Served in 3.200 secs. -->
	</body>
<!-- Cached 20200207103811 -->
</html>